Combinatorial Vector Field Topology in 3 Dimensions
نویسندگان
چکیده
In this paper, we present two combinatorial methods to process 3-D steady vector fields, which both use graph algorithms to extract features from the underlying vector field. Combinatorial approaches are known to be less sensitive to noise than extracting individual trajectories. Both of the methods are a straightforward extension of an existing 2-D technique to 3-D fields. We observed that the first technique can generate overly coarse results and therefore we present a second method that works using the same concepts but produces more detailed results. We evaluate our method on a CFD-simulation of a gas furnace chamber. Finally, we discuss several possibilities for categorizing the invariant sets respective to the flow.
منابع مشابه
Combinatorial 2D Vector Field Topology Extraction and Simplification
This paper investigates a combinatorial approach to vector field topology. The theoretical basis is given by Robin Forman’s work on a combinatorial Morse theory for dynamical systems defined on general simplicial complexes. We formulate Forman’s theory in a graph theoretic setting and provide a simple algorithm for the construction and topological simplification of combinatorial vector fields o...
متن کاملA generic topology library
We present a generic topology library that is based on topological space and combinatorial properties. A notation is introduced whereby data structures can be described by their topological cell dimensions and internal combinatorial properties. A common interface for different types of data structures is presented. Various issues of iteration of these data structures can be explained from the t...
متن کاملMatroid Bundles
Combinatorial vector bundles, or matroid bundles, are a combinatorial analog to real vector bundles. Combinatorial objects called oriented matroids play the role of real vector spaces. This combinatorial analogy is remarkably strong, and has led to combinatorial results in topology and bundle-theoretic proofs in combinatorics. This paper surveys recent results on matroid bundles, and describes ...
متن کاملVisualizing Forman’s discrete vector field
Morse theory has been considered to be a powerful tool in its applications to computational topology, computer graphics and geometric modeling. Forman introduced a discrete version of it, which is purely combinatorial. This opens Morse theory applications to a much larger scope. The main objective of this work is to illustrate Forman’s theory. We intend to use some of Forman’s concepts to visua...
متن کاملA Combinatorial Tool for Computing the Effective Homotopy of Iterated Loop Spaces
This paper is devoted to the Cradle Theorem. It is a combinatorial contraction discovered when studying a crucial point of the effective Bousfield-Kan spectral sequence, an unavoidable step to make effective the famous Adams spectral sequence. The homotopy equivalence TOP(Sp,TOP(Sq, X)) ∼ TOP(Sp+q, X) is obvious in ordinary topology, not surprising in combinatorial topology, but it happens the ...
متن کامل